home *** CD-ROM | disk | FTP | other *** search
/ NetNews Offline 2 / NetNews Offline Volume 2.iso / news / comp / lang / c-part2 / 14097 < prev    next >
Encoding:
Internet Message Format  |  1996-08-05  |  933 b 
  1. Path: anvil.ugrad.cs.ubc.ca!not-for-mail
  2. From: c2a192@ugrad.cs.ubc.ca (Kazimir Kylheku)
  3. Newsgroups: comp.lang.c
  4. Subject: Re: fast find algorithm
  5. Date: 11 Apr 1996 12:09:28 -0700
  6. Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
  7. Message-ID: <4kjld8INNngs@anvil.ugrad.cs.ubc.ca>
  8. References: <Dp8wE6.8DG@cix.compulink.co.uk> <4ju12t$ovh@news.xs4all.nl> <828824754snz@genesis.demon.co.uk>
  9. NNTP-Posting-Host: anvil.ugrad.cs.ubc.ca
  10.  
  11. In article <828824754snz@genesis.demon.co.uk>,
  12. Lawrence Kirby  <fred@genesis.demon.co.uk> wrote:
  13. >In article <4ju12t$ovh@news.xs4all.nl> falstaff@xs4all.nl "Falstaff" writes:
  14. >>Hashing is slightly slower than straight table lookup and can't be
  15. >>used when you want to delete elements from your table.
  16. >
  17. >It can, you can use a technique like deleted item markers.
  18.  
  19. On Usenet, you really come to wonder where some people went to learn about
  20. computer science topics, don't you?
  21. -- 
  22.  
  23.